منابع مشابه
Some model theory of SL(2,R)
We study the action of G = SL(2,R), viewed as a group definable in the structure M = (R,+,×), on its type space SG(M). We identify a minimal closed G-flow I, and an idempotent r ∈ I (with respect to the Ellis semigroup structure ∗ on SG(M)). We also show that the “ideal group” (r ∗ I, ∗) is nontrivial (in fact it will be the group with 2 elements), yielding a negative answer to a question of Ne...
متن کاملHyperconvexity of R-trees
It is shown that for a metric space (M,d) the following are equivalent: (i) M is a complete R-tree; (ii) M is hyperconvex and has unique metric segments.
متن کاملLecture Notes: R-trees
In theoretical studies, we often develop structures that are dedicated to specific problems. In practice, often it is unrealistic to create many different indexes on the same dataset to support various types of queries, because doing so will incur prohibitive space consumption and update overhead. Therefore, it would be nice to have a single, all-around, structure, which occupies small space, c...
متن کاملAn Efficient Cost Model for Spatial Joins Using R-trees
Spatial join is one of the fundamental operations in a Spatial Data Base Management System. Recently, the family of R-tree-based data structures has been adopted to support the execution of spatial joins. This paper introduces an analytical model that efficiently estimates the cost (in terms of disk accesses) of a spatial join query between two spatial datasets. The proposed model is based on a...
متن کاملEfficient Historical R-trees
The Historical R-tree is a spatio-temporal access method aimed at the retrieval of window queries in the past. The concept behind the method is to keep an R-tree for each timestamp in history, but allow consecutive trees to share branches when the underlying objects do not change. New branches are only created to accommodate updates from the previous timestamp. Although existing implementations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Analysis
سال: 2020
ISSN: 1759-9008
DOI: 10.4115/jla.2020.12.3